Maximum weighted matching with few edge crossings for 2-layered bipartite graph
نویسندگان
چکیده
منابع مشابه
Graphs Drawn with Few Crossings Per Edge
Given a simple graph G, let v(G) and e(G) denote its number of vertices and edges, respectively. We say that G is drawn in the plane if its vertices are represented by distinct points of the plane and its edges are represented by Jordan arcs connecting the corresponding point pairs but not passing through any other vertex. Throughout this paper, we only consider drawings with the property that ...
متن کاملsranjans : Semantic Textual Similarity using Maximal Weighted Bipartite Graph Matching
The paper aims to come up with a system that examines the degree of semantic equivalence between two sentences. At the core of the paper is the attempt to grade the similarity of two sentences by finding the maximal weighted bipartite match between the tokens of the two sentences. The tokens include single words, or multiwords in case of Named Entitites, adjectivally and numerically modified wo...
متن کاملBipartite Matching with Linear Edge Weights
Consider a complete weighted bipartite graph G in which each left vertex u has two real numbers intercept and slope, each right vertex v has a real number quality, and the weight of any edge (u, v) is defined as the intercept of u plus the slope of u times the quality of v. Let m (resp., n) denote the number of left (resp., right) vertices, and assume that m ≥ n. We develop a fast algorithm for...
متن کاملTwo-Layered Genetic Network Drawings with Minimum Edge Crossings
Inference of genetic networks from expression profile data is one of the challenging works in the field of the array informatics. A good visualization tool for the inferred networks would help us to deepen our understandings of the interactions among the genes. Here, we focus on the time series data of expression profiles, and discuss the method to draw a two-layered graph representing the caus...
متن کاملOn Weighted Bipartite Edge Coloring
We study weighted bipartite edge coloring problem, which is a generalization of two classical problems: bin packing and edge coloring. This problem has been inspired from the study of Clos networks in multirate switching environment in communication networks. In weighted bipartite edge coloring problem, we are given an edge-weighted bipartite multigraph G = (V,E) with weights w : E → [0, 1]. Th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2020
ISSN: 0166-218X
DOI: 10.1016/j.dam.2020.07.017